tree decomposition造句
例句与造句
- the successful application of higher order connectedness on tree decomposition leads us to seek further implementation of higher order connectedness to other branches of graph theory
而成功地应用高阶边连通性证明树分解中的问题，使我们进一步寻找高阶连通性在其它图论问题中的应用。 - in the last chapter, we use the results of higher order edge connectivity to study the tree decomposition of transitive graphs, deriving a sufficient condition for a graph to have tree number equivalent to the arboricity
在最后一章中，我们使用高阶边连通度的结果研究对称图中树分解的一个问题，给出了森林数等于树数的一个充分条件。 - fractal coding has been proved useful for image compression . it is also proved effective for content-based image retrieval . in the paper, we present a block-constrained fractal coding scheme and a matching strategy for content-based image retrieval . in this coding scheme, an image is partitioned into non-overlap blocks of a size close to that of a query iconic image . fractal codes are generated for each block independently . in the similarity measure of fractal codes, an improved nona-tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity . our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval, and is compared favorably with other two methods tested in terms of storage usage and computing time
分形编码在图像压缩方面取得了很好的效果，同时，分形编码也能够用于基于内容的图像检索.本文提出了一种基于块限制的分形编码算法和匹配策略，并将它们用于图像检索.在我们编码算法中，图像会被预先分成互相不重叠的子图像块，然后对这些子图像进行独立地分形编码，从而获得整幅图像的分形码.该编码算法能够在很大程度上减少编码时间.在进行图像间相似性的匹配时，我们采用改进的基于九叉树的分配策略，从而避免全局地进行分形码的匹配，减少了计算量.实验结果说明，我们的编码算法和匹配策略能够比较有效地应用于基于内容的图像检索，在计算时间和存储时间上都优于实验中其它两种方法 - It's difficult to find tree decomposition in a sentence. 用tree decomposition造句挺难的